Random Feynman Graphs
نویسنده
چکیده
We investigate a class of random graph ensembles based on the Feynman graphs of multidimensional integrals, representing statistical-mechanical partition functions. We show that the resulting ensembles of random graphs strongly resemble those defined in random graphs with hidden color, generalizing the known relation of the Feynman graphs of simple one-dimensional integrals to random graphs with a given degree distribution.
منابع مشابه
ar X iv : h ep - l at / 9 70 40 20 v 1 3 0 A pr 1 99 7 Potts Models on Feynman Diagrams
We investigate numerically and analytically Potts models on " thin " random graphs – generic Feynman diagrams, using the idea that such models may be expressed as the N → 1 limit of a matrix model. The thin random graphs in this limit are locally tree-like, in distinction to the " fat " random graphs that appear in the planar Feynman diagram limit, N → ∞, more familiar from discretized models o...
متن کاملThe Yang-Lee Edge Singularity on Feynman Diagrams
We investigate the Yang-Lee edge singularity on non-planar random graphs, which we consider as the Feynman Diagrams of various d = 0 field theories, in order to determine the value of the edge exponent σ. We consider the hard dimer model on φ and φ random graphs to test the universality of the exponent with respect to coordination number, and the Ising model in an external field to test its tem...
متن کاملVertex Models on Feynman Diagrams
The statistical mechanics of spin models, such as the Ising or Potts models, on generic random graphs can be formulated economically by considering the N → 1 limit of N ×N Hermitian matrix models. In this paper we consider the N → 1 limit in complex matrix models, which describes vertex models of different sorts living on random graphs. From the graph theoretic perspective one is using matrix m...
متن کاملSome measure theory on stacks of graphs
By counting symmetries of graphs carefully (or equivalently, by regarding moduli spaces of graphs as zero-dimensional orbifolds), certain measures on these collections (elsewhere called ‘exponential random graphs’) can be reinterpreted, with the aid of special cases of Wick’s theorem, as Feynman-style measures on the real line. Analytic properties of the latter measures can then be studied in t...
متن کامل1 6 M ay 1 99 7 Why Loops Don ’ t Matter
In recent work [1] we have found identical behaviour for various spin models on " thin " random graphs-Feynman diagrams-and the corresponding Bethe lattices. In this paper we observe that the ratios of the saddle point equations in the random graph approach are identical to the fixed point(s) of the recursion relations which are used to solve the models on the Bethe lattice. The loops in the ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005